Bipacking pairs by quintuples: The case nu=13 (mod 20)
نویسنده
چکیده
A (v, K, A) packing design of order v, block size K, and index 1 is a collection of K-element subsets, called blocks, of a v-set V such that every 2-subset of V occurs in at most L blocks. The packing problem is to determine the maximum number of blocks in a packing design. Packing with 1= 2 is called bipacking. In this paper we solve the bipacking problem in the case K = 5 and v = 13 (mod 20).
منابع مشابه
A note on the new basis in the mod 2 Steenrod algebra
The Mod $2$ Steenrod algebra is a Hopf algebra that consists of the primary cohomology operations, denoted by $Sq^n$, between the cohomology groups with $mathbb{Z}_2$ coefficients of any topological space. Regarding to its vector space structure over $mathbb{Z}_2$, it has many base systems and some of the base systems can also be restricted to its sub algebras. On the contrary, in ...
متن کاملA Note on Diophantine Quintuples
Introduction. Diophantus noted that the rational numbers 1/16, 33/16, 17/4 and 105/16 have the following property: the product of any two of them increased by 1 is a square of a rational number (see [2, 3]). Let n be an integer. A set of positive integers {a1, a2, . . . , am} is said to have the property D(n) if aiaj + n is a perfect square for all 1 ≤ i < j ≤ m. Such a set is called a Diophant...
متن کاملQuaternary Golay sequence pairs II: odd length
A 4-phase Golay sequence pair of length s ≡ 5 (mod 8) is constructed from a Barker sequence of the same length whose even-indexed elements are prescribed. This explains the origin of the 4-phase Golay seed pairs of length 5 and 13. The construction cannot produce new 4-phase Golay sequence pairs, because there are no Barker sequences of odd length greater than 13. A partial converse to the cons...
متن کاملAn upper approximation to the BIBD (15, 21, 7, 5, 2)
The design (15,21,7,5,2) is the only BIBD of block size 5 that does not exist. If it did exist, it would provide an exact bicovering, in 21 blocks of size 5, of the pairs from 15 points. However, we show that 22 quintuples are sufficient to provide a bicover of the pairs from 15 points; thus there are only 10 repetitions required in the bicovering.
متن کاملThe Number of Diophantine Quintuples
A set {a1, . . . , am} of m distinct positive integers is called a Diophantine m-tuple if aiaj + 1 is a perfect square for all i, j with 1 ≤ i < j ≤ m. It is known that there does not exist a Diophantine sextuple and that there exist only finitely many Diophantine quintuples. In this paper, we first show that for a fixed Diophantine triple {a, b, c} with a < b < c, the number of Diophantine qui...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 133 شماره
صفحات -
تاریخ انتشار 1994